Attributed Tree Homomorphism Using Association Graphs
نویسندگان
چکیده
...
منابع مشابه
Inexact graph matching for model-based recognition: Evaluation and comparison of optimization algorithms
A method for segmentation and recognition of image structures based on graph homomorphisms is presented in this paper. It is a model-based recognition method where the input image is over-segmented and the obtained regions are represented by an attributed relational graph (ARG). This graph is then matched against a model graph thus accomplishing the model-based recognition task. This type of pr...
متن کاملMining Patterns in Networks using Homomorphism
In recent years many algorithms have been developed for finding patterns in graphs and networks. A disadvantage of these algorithms is that they use subgraph isomorphism to determine the support of a graph pattern; subgraph isomorphism is a well-known NP complete problem. In this paper, we propose an alternative approach which mines tree patterns in networks by using subgraph homomorphism. The ...
متن کاملCovering and spanning tree of graphs
In this note we recall some well-known results about covering and k-covering of graphs. Then, we introduce a new notion of spanning tree which we call the p-spanning tree. This notion allows us to reduce the upper bound for the minimum integer k for which a connected graph G has no nontrivial k-covering. This note deals with the notion of covering of graphs and more precisely with the notion of...
متن کاملOn maximal finite antichains in the homomorphism order of directed graphs
We show that the pairs {T, DT } where T is a tree and DT its dual are the only maximal antichains of size 2 in the category of directed graphs endowed with its natural homomorphism ordering.
متن کاملDichotomy for tree-structured trigraph list homomorphism problems
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to be polynomial time solvable or NP -complete. Thus while digraph list homomorphism problems enjoy dichotomy (each problem is NP -complete or polynomial time solvable), such dichotomy is not necessarily expected for tri...
متن کامل